cleans uncertain databas leverag aggreg constraint adapt system anomali predict larg dscale host infrastructur incorpor post dclick behavior click model mapdupreduc detect duplic massiv dataset comput label dconstraint reachabl graph databas leverag spatio dtempor redund rfid data cleans algorithm approach event summar leverag spatio dtempor redund rfid data cleans optim content fresh relat extract web keyword search mine concept ddrift data stream recent mine data stream concept drift action insight import challeng task wide rang applic includ credit card fraud protect target market network intrus detect convent knowledg discoveri tool face challeng overwhelm volum stream data concept drift paper propos gener framework mine concept drift data stream weight ensembl classifi train ensembl classif model ripper naiv bayesian sequenti chunk data stream classifi ensembl judici weight base expect classif accuraci test data time evolv environ ensembl approach improv effici learn model accuraci perform classif empir studi show propos method substanti advantag singl classifi approach predict accuraci ensembl framework effect varieti classif model report intern workshop cloud data manag clouddb proceed intern cikm workshop cloud data manag semant queri databas problem challeng clouddb workshop summari learn rank kernel perceptron method onlin anomali predict robust cluster system concept cluster evolv data weight proxim djoin inform retriev abstract problem effici comput weight proxim join multipl list applic inform retriev extract multi termqueri andforeachqueryterm alistofallitsmatch withscor sort locat problemi findth matchset consist match list combin score score function maxim studi type function individu match score proxim match locat score matchset present algorithm exploit properti score function order achiev time complex linear size match list experi show algorithm greatli outperform naiv algorithm base take cross product match list final extend algorithm altern problem definitionapplic inform extract find good matchset document invers time depend convex regular learn queri integr assur locat dbase servic access outsourc spatial databas dual encrypt queri integr assur fast comput reachabl label larg graph high compress rate numer applic deal larg graph queri reachabl node graph hop cover compactli repres edg transit closur graph space answer reachabl queri effici challeng comput hop cover exist approach suffer larg resourc consumpt low compress rate paper propos hierarch partit approach partit larg graph subgraph repeatedli top fashion uniqu featur approach comput hop cover partit iter top partit provid techniqu comput hop cover connect subgraph cover comput cut graph subgraph result cover high compress entir graph approach propos node orient approach edg orient approach approach effici comput hop cover larg graph high compress rate extens experi studi show hop cover graph node billion connect obtain minut compress rate pc provid fresh guarante outsourc databas databas outsourc increasingli attract advanc network technolog elimin perceiv perform differ hous databas outsourc databas price advantag parti databas servic provid continu increas due economi scale potenti explos growth databas outsourc hamper secur concern data privaci queri integr outsourc databas privaci issu outsourc databas extens studi queri integr outsourc databas start draw attent databas commun exist solut provid complet integr previou studi examin mechan provid fresh guarante assur queri execut date data version data past provid practic solut fresh guarante challeng continu monitor data date expens paper perform studi add fresh guarante propos scheme includ authent data structur base probabilist base approach provid integr assur implement solut perform extens experi quantifi cost experi result show provid reason tight fresh guarante sacrif perform model queri dcommerc data hybrid relat dxml dbmss sampl dbase approach inform recoveri abstract recent resurg interest research noisi incomplet data applic requir inform recov data ideal approach inform recoveri featur incorpor prior knowledg data knowledg form complex distribut constraint close form solut exist captur complex correl quantifi degre uncertainti recov data support queri data databas commun develop number approach inform recoveri gener offer featur overcom limit significantli gener approach inform recoveri base sampl appli sequenti import sampl techniqu statist work complex distribut dramat outperform naiv sampl data constrain illustr gener effici approach applic scenario cleans rfid data recov inform publish data summar random privaci fast graph pattern match effici answer reachabl queri larg direct graph effici process queri larg graph import research topic larg driven emerg real world applic divers xml databas gi web mine social network analysi ontolog bioinformat graph reachabl attract lot research attent reachabl queri common graph databas serv fundament oper graph queri main idea answer reachabl queri graph build indic base reachabl label essenti vertex graph assign label reachabl vertic determin label approach propos build reachabl label interv label tree cover hop label due larg number vertic real world graph graph easili million vertic comput cost index size label exist method prove expens practic paper introduc graph structur refer pathtre label larg graph path tree cover span subgraph tree shape demonstr analyt empir effect approach lock dfree consist control web applic time dstamp manag queri execut data stream manag system locat dbase spatial queri process wireless broadcast environ cluster pattern similar cluster process group set object class similar object definit similar vari cluster model model concept similar base distanc euclidean distanc cosin distanc word similar object requir close valu set dimens paper explor gener type similar pcluster model propos object similar exhibit coher pattern subset dimens instanc dna microarrai analysi express level gene rise fall synchron respons set environment stimuli magnitud express level close pattern exhibit alik discoveri cluster gene essenti reveal signific connect gene regulatori network commerc applic collabor filter benefit model captur close valu lead indic close purchas brows pattern exhibit custom paper introduc effect algorithm detect cluster perform test real synthet data set show effect advanc web network technolog locat dbase spatial queri data share wireless broadcast environ locat base spatial queri lbsq refer spatial queri answer reli locat inquir effici process lbsq critic import increas deploy mobil technolog show lbsq uniqu characterist tradit spatial queri process central databas address signific challeng present wireless broadcast environ exhibit high latenc databas access paper present queri process techniqu maintain high scalabl accuraci manag reduc latenc consider answer locat base spatial queri approach base peer peer share enabl process queri delai mobil host queri result cach neighbor mobil peer illustr appeal techniqu extens simul result semant data manag queri data mean adapt load diffus multiwai window stream join gstring approach effici search graph databas graph wide model complic data includ chemic compound protein interact xml document multimedia inform retriev data formul graph search problem find effici solut problem essenti applic popular approach repres graph queri graph sequenc convert graph search subsequ match state art sequenc method work finest granular node edg graph element result sequenc method semant consciou result sequenc bulki prone complex aris graph isomorph problem search paper introduc sequenc method captur semant underli graph data find meaning compon graph structur basic unit sequenc reduc size result sequenc enabl semant base search paper base approach chemic compound databas appli search complic graph protein structur experi demonstr approach outperform state ofth art graph search method comput compress multidimension skylin cube effici recent skylin comput analysi extend singl full space multidimension subspac lead valuabl insight applic compress skylin cube form skylin group decis subspac provid succinct summar compress multidimension subspac skylin comput skylin cube remain challeng task exist method search exponenti number nonempti subspac subspac skylin paper propos effici method stellar exploit interest skylin group lattic small subset object skylin full space show skylin group lattic easi comput extend skylin group lattic object comput skylin full space stellar enumer skylin group decis subspac full space skylin object avoid search skylin exponenti number subspac improv effici scalabl subspac skylin comput substanti practic extens perform studi verifi merit method flexibl queri graph base model effici execut continu queri event summar system manag load shed classifi multi dsourc stream data bay risk approach monitor multipl stream sourc collect decis make present challeng stream data larg volum fast speed highli bursti natur imposs offload classif decis individu data sourc lack full knowledg decis make central classifi respons decis make frequent overload paper studi intellig load shed classifi multi sourc data aim maxim classif qualiti resourc cpu bandwidth constraint markov model predict distribut featur valu time leverag bayesian decis theori bay risk analysi model varianc data sourc contribut classif qualiti adopt expect observ risk criterion quantifi loss classif qualiti due load shed propos featur bff algorithm greedili minim risk effect approach propos confirm experi support rank cluster gener order dby group dby boolean semant sql queri adequ captur fuzzi prefer soft criteria requir tradit data retriev applic solv problem add flavor inform retriev databas queri allow fuzzi queri condit flexibl support group rank queri result dbm engin rank support major commerci dbmss nativ support flexibl group limit group paper propos gener group enabl flexibl group cluster specif queri result cluster data mine applic focu support effici cluster boolean result gener queri time propos integr rank cluster boolean condit form type clusterrank queri structur data retriev integr nontrivi term semant queri process investig semant type queri process queri straightforward approach simpli glue techniqu develop rank cluster approach costli rank cluster treat block post process task boolean queri result exist techniqu propos summari base evalu method util bitmap index seamlessli integr boolean condit cluster rank experiment studi show approach significantli outperform straightforward maintain high cluster qualiti blink rank keyword search graph queri process graph structur data enjoi grow number applic top keyword search queri graph nd top answer rank criteria answer substructur graph queri keyword current techniqu support queri gener graph suffer drawback poor worst case perform take full advantag index high memori requir address problem propos blink bi level index queri process scheme top keyword search graph blink search strategi provabl perform bound addition exploit bi level index prune acceler search reduc index space blink partit data graph block bilevel index store summari inform block level initi guid search block detail inform block acceler search block experi show blink offer order magnitud perform improv exist approach unifi data domain knowledg virtual view databas commun constant quest integr data manag knowledg manag recent increas ontolog applic quest concret urgent manipul knowledg relat data dbmss trivial undertak paper introduc unifi framework manag data domain knowledg provid user virtual view unifi data domain knowledg knowledg infer data domain knowledg virtual view relat format user queri data knowledg seamlessli integr manner facilit knowledg represent inferenc databas engin approach leverag xml support hybrid relat xml dbmss microsoft sql server amp ibm db purexml provid queri rewrit mechan bridg differ logic physic data model queri virtual view automat transform compon execut hybrid relat xml engin transpar user integr audit outsourc data increas number enterpris outsourc servic parti offer servic lower cost due economi scale qualiti servic major concern outsourc queri integr mean queri result return servic provid correct complet assur previou work requir client manag data local audit result back server databas engin modifi gener authent result paper introduc integr audit mechan elimin costli requir approach insert small amount record outsourc databas integr system effect audit analyz insert record queri result studi random determinist approach gener insert record record gener signific implic storag perform show method provabl secur mean withstand attack adversari comput power bound analyt empir result demonstr effect method low dgranular classifi data stream concept drift bias class distribut data stream languag system design power extens fast comput reachabl label larg graph numer applic deal larg graph queri reachabl node graph hop cover compactli repres edg transit closur graph space answer reachabl queri effici challeng comput hop cover exist approach suffer larg resourc consumpt low compress rate paper propos hierarch partit approach partit larg graph subgraph repeatedli top fashion uniqu featur approach comput hop cover partit iter top partit provid techniqu comput hop cover connect subgraph cover comput cut graph subgraph result cover high compress entir graph approach propos node orient approach edg orient approach approach effici comput hop cover larg graph high compress rate extens experi studi show hop cover graph node billion connect obtain minut compress rate pc fast comput reachabl label larg graph numer applic deal larg graph queri reachabl node graph hop cover compactli repres edg transit closur graph space answer reachabl queri effici challeng comput hop cover exist approach suffer larg resourc consumpt low compress rate paper propos hierarch partit approach partit larg graph subgraph repeatedli top fashion uniqu featur approach comput hop cover partit iter top partit provid techniqu comput hop cover connect subgraph cover comput cut graph subgraph result cover high compress entir graph approach propos node orient approach edg orient approach approach effici comput hop cover larg graph high compress rate extens experi studi show hop cover graph node billion connect obtain minut compress rate pc dual label answer graph reachabl queri constant time graph reachabl fundament wide rang applic includ xml index geograph navig internet rout ontolog queri base rdf owl applic involv huge graph requir fast answer reachabl queri reachabl label method propos purpos assign label vertic reachabl vertic decid label spars graph hop base reachabl label scheme answer reachabl queri effici small label space label process time consum practic larg graph paper propos label scheme spars graph scheme ensur graph reachabl queri answer constant time spars graph complex label process linear make algorithm applic massiv dataset analyt experiment result show approach effici stateof art approach label method altern scheme tradeoff queri time label space benefit applic tree graph fast relev discoveri time seri loci load shed class dpreserv data acquisit balanc ensembl approach weight classifi text classif suppress model overfit mine concept ddrift data stream find global iceberg distribut data set discov frequent close partial order string abstract mine knowledg order sequenc data import problem applic bioinformat web mine network manag intrus detect custom follow partial order purchas seri product partial order predict relat custom futur purchas develop market campaign biolog sequenc microarrai data cluster base partial order share sequenc set item total order subset item repres string string databas multiset string paper identifi problem mine frequent close partial order string frequent close partial order captur nonredund interest order inform string databas importantli mine frequent close partial order discov meaning knowledg disclos previou data mine techniqu problem mine frequent close partial order challeng tackl problem develop frecpo frequent close partial order practic effici algorithm mine complet set frequent close partial order larg string databas interest prune techniqu devis speed search report extens perform studi real data set synthet data set illustr effect effici approach index term frequent pattern close pattern partial order string data mine catch moment maintain close frequent itemset data stream slide window paper consid problem mine close frequent itemset data stream slide window limit memori space design synopsi data structur monitor transact slide window output current close frequent itemset time due time memori constraint synopsi data structur monitor itemset monitor frequent itemset make imposs detect itemset frequent paper introduc compact data structur close enumer tree cet maintain dynam select set itemset slide window select itemset boundari close frequent itemset rest itemset concept drift data stream reflect boundari movement cet word statu chang itemset frequent frequent occur boundari compact reachabl label graph dstructur data test reachabl node graph problem import applic includ knowledg represent program analysi recent biolog ontolog databas inferenc xml queri process approach propos encod graph reachabl inform node label scheme exist scheme work specif type graph paper propos approach hlss hybrid label structur identifi type substructur graph encod techniqu suitabl characterist implement hlss effici phase algorithm phase identifi encod strongli connect compon tree substructur phase encod remain reachabl relationship compress dens rectangular submatric transit closur matrix import subproblem find densest submatric demonstr hard problem propos practic algorithm experi show hlss handl type graph exist approach fall prei graph substructur design handl final discuss updat reachabl label graph updat qualit show hlss support effici updat exist approach stai current relev data mine research onlin mine data stream applic techniqu progress sequenc tree structur xml index sequenc base xml index aim avoid expens join oper queri process transform structur xml data sequenc structur queri answer holist subsequ match paper address problem queri equival respect transform introduc perform orient principl sequenc tree structur queri equival xml queri perform subsequ match join oper post process special handl problem fals alarm identifi class sequenc method purpos present subsequ match algorithm observ queri equival queri equival prerequisit sequenc base xml index goal find sequenc strategi regard time space complex index queri xml data end introduc perform orient principl guid sequenc tree structur xml dataset principl find optim sequenc strategi schema data distribut present method realiz principl experi show advantag sequenc base index tradit xml index method compar sequenc strategi demonstr benefit perform orient sequenc principl reduc classifi granular mine concept ddrift data stream effici mine frequent close partial order pattern dbase similar search microarrai data loadstar load shed scheme classifi data stream problem resourc alloc mine multipl data stream due larg volum high speed stream data mine algorithm cope ect system overload realiz maximum mine benefit resourc constraint challeng task paper propos load shed scheme classifi multipl data stream focu problem classifi data drop load shed scheme ii decid drop data stream introduc qualiti decis qod metric measur level uncertainti classif exact featur valu data load shed markov model predict distribut featur valu make classif decis predict valu qod metric resourc alloc multipl data stream maxim qualiti classif decis load shed scheme learn adapt chang data characterist data stream experi synthet data real life data show load shed scheme ectiv improv accuraci classif resourc constraint keyword data mine data stream load shed classif qualiti decis featur predict markov model dneighbor search pattern distanc space nativ extens sql mine data stream loadstar load shed data stream mine demo show intellig load shed essenti achiev optimum result mine data stream resourc constraint loadstar system introduc load shed techniqu classifi multipl data stream larg volum high speed loadstar metric qualiti decis qod measur level uncertainti classif resourc alloc sourc uncertainti high make optimum classif decis accur qod measur loadstar reli featur predict model data drop load shed mechan loadstar adapt chang data characterist data stream system offer nice solut data mine resourc constraint mine data stream abstract mine data stream rais number research challeng data mine commun challeng includ limit comput resourc mine stream data mobil devic limit resourc due continu data stream algorithm pass incom data record articl algorithm output granular aog approach mine data stream discuss aog adapt approach cope challeng inher featur data stream show result aog base cluster resourc constrain environ prefer dbase frequent pattern mine improv biclust method analyz gene express profil mine extrem skew trade anomali demand ddriven frequent itemset mine pattern structur mine extrem skew trade anomali moment maintain close frequent itemset stream slide window paper consid problem mine close frequent itemset slide window limit memori space design synopsi data structur monitor transact slide window output current close frequent itemset time due time memori constraint synopsi data structur monitor itemset monitor frequent itemset make imposs detect itemset frequent paper introduc compact data structur close enumer tree cet maintain dynam select set itemset slide window select itemset consist boundari close frequent itemset rest itemset concept drift data stream reflect boundari movement cet word statu chang itemset frequent frequent occur boundari boundari stabl cost mine close frequent itemset slide window dramat reduc mine transact possibl boundari movement cet experi show algorithm perform previou approach activ mine data stream previous propos mine method data stream make unrealist assumpt label data stream readili mine anytim real world problem label data stream rare immedi due reason model reconstruct label data period passiv stream mine model drawback propos concept demand driven activ data mine activ mine loss model continu guess true class label estim small number instanc actual class label verifi pai afford cost estim loss toler threshold model evolv small number instanc verifi true class label previou work activ mine concentr error guess estim paper discuss approach decis tree evolut xseq index infrastructur tree pattern queri tree pattern queri xml index approach decompos multipl queri join result provid answer origin queri join oper identifi time consum fast algorithm subspac cluster pattern similar queri languag data model databas sequenc data stream studi fundament limit relat algebra ra sql support sequenc stream queri present effect queri languag data model enrich deal begin observ limit sql applic domain import data stream sequenc queri data mine present formal proof continu queri data stream sql su er addit express power problem begin focus notion nonblock nb queri continu queri support data stream character notion nonblock queri show equival monoton queri notion ra formal abil express monoton queri express ra monoton oper ra show ra nb complet sql power ra monoton queri estim select xml path express predic histogram abstract select estim path express queri xml data plai import role queri optim path express multipl branch predic impact select entir queri paper propos method base dimension histogram estim select path express embed predic histogram captur correl structur valu xml data defin set oper histogram tradit histogram captur node posit distribut construct cost tree base oper select node branch path express estim execut cost tree compar previou method ignor distribut method offer estim accuraci enhanc biclust express data molecular biologi provid power tool express pattern thousand gene monitor simultan produc huge amount valuabl data concept biclust introduc cheng church captur coher subset gene subset condit set heurist algorithm design find biclust set biclust consist iter mask null valu discov biclust coars fine node delet node addit inclus invert data heurist inevit suffer drawback mask null valu discov biclust random number result phenomenon random interfer turn impact discoveri high qualiti biclust address issu acceler biclust process gener model biclust incorpor null valu propos probabilist algorithm floc discov set possibl overlap biclust simultan algorithm easili extend support addit featur suit requir virtual cost experiment studi yeast gene express data show floc algorithm offer substanti improv previous propos algorithm index weight dsequenc larg databas present index structur manag weight sequenc larg databas weight sequenc defin dimension structur element sequenc weight seri network event instanc weight sequenc event timestamp queri larg sequenc databas event occurr pattern step understand tempor causal relationship event index structur propos paper enabl effici retriev databas subsequ possibl contigu match queri sequenc event weight index method take consider uniform frequenc distribut event sequenc data addit method find broad rang applic index scientif data consist multipl numer column discoveri correl column instanc index dna micro arrai record express level gene condit enabl search gene respons experiment perturb follow pattern demonstr real world data set method effect effici mapl fast algorithm maxim pattern dbase cluster mine type arbitrarili posit overlap cluster genet data find interest pattern mapl fast algorithm maxim pattern dbase cluster mine type arbitrarili posit overlap cluster genet data find interest pattern random model accuraci effici induct learn sequenti data scan mine concept ddrift data stream ensembl classifi recent mine data stream concept drift action insight import challeng task wide rang applic includ credit card fraud protect target market network intrus detect convent knowledg discoveri tool face challeng overwhelm volum stream data concept drift paper propos gener framework mine concept drift data stream weight ensembl classifi train ensembl classif model ripper naiv bayesian sequenti chunk data stream classifi ensembl judici weight base expect classif accuraci test data time evolv environ ensembl approach improv effici learn model accuraci perform classif empir studi show propos method substanti advantag singl classifi approach predict accuraci ensembl framework effect varieti classif model atla nativ extens sql data mine incomplet databas languag data stream data mine problem cure vist dynam index method queri xml data tree structur research provid flexibl queri facil extract data structur xml document paper propos vist index structur search xml document repres xml document xml queri structur encod sequenc show queri xml data equival find subsequ match unlik index method disassembl queri multipl queri join result queri provid final answer vist tree structur basic unit queri avoid expens join oper vist unifi index content structur xml document perform advantag method index content structur vist support dynam index updat reli sole tree special data structur support dbmss experi show vist ectiv scalabl cient support structur queri atla small complet sql extens data mine data stream introduct dbmss long suffer sql lack power extens implement atla power databas languag system enabl user develop complet data intens applic sql write aggreg tabl function sql procedur languag current object relat system result atla sql ture complet suitabl advanc data intens applic data mine stream queri atla system download suit applic includ data mine function code atla sql execut modest perform overhead respect applic written propos demo illustr kei featur applic atla demonstr atla sql featur includ nativ support user defin aggreg tabl functi recent progress select topic databas research report young chines research work unit state deduct databas system ldl paper describ system research advanc enabl design develop begin discuss nonmonoton nondeterminist construct extend function languag preserv model theoret fixpoint semant describ execut model open architectur design support construct facilit integr exist dbmss applic final describ lesson learn test applic middlewar datamin prune dynam schedul cost dsensit ensembl index structur pattern similar search dna microarrai dat extend sql decis support applic fulli distribut framework cost dsensit data mine paper propos fulli distribut system compar central partial distribut system cost sensit data mine experiment result shown approach achiev higher accuraci central partial distribut learn method incur train time commun comput overhead atla system power databas languag base simpl extens sql delta dcluster captur subspac correl larg data set cluster activ research area great practic import recent year previou cluster model focus group object similar valu set dimens subspac cluster assum object dimens biclust exist cluster model adequ captur coher exhibit object strong coher exist set object subset attribut valu attribut attribut valu fulli common applic includ bio informat analysi collabor filter analysi data incomplet subject bias bio informat biclust model recent propos captur coher subset attribut introduc gener model refer ffi cluster model captur coher exhibit subset object subset attribut allow absent attribut valu move base algorithm floc devis effici produc optim cluster result ffi cluster model take biclust model special case floc algorithm perform superior biclust algorithm demonstr correct effici ffi cluster model floc algorithm number real synthet data set progress model present induct learn perform frustrat batch process user interact system control final accuraci train time accuraci produc model low comput resourc misspent paper propos progress model framework progress model learn algorithm estim onlin accuraci final model remain train time estim accuraci expect user termin train prior complet wast resourc user choos complet learn process progress model comput model expect accuraci expect time describ implement progress model ensembl classifi empir comparison reinforc learn strategi sequenti target market empir evalu perform reinforc learn method applic sequenti target market propos evalu progress reinforc learn method rang direct batch method indirect simul base method call semidirect method fall conduct number control experi evalu perform compet method result indirect method perform situat perfect model realist situat system model paramet restrict attent indirect method perform tend degrad show semi direct method effect reduc amount comput attain level perform result profit polici user ddirect explor mine space multipl attribut mine associ pattern structur larg relat tabl associ rule mine aim discov pattern support threshold mine pattern compos item arbitrari subset attribut larg relat tabl repres challeng practic applic includ event manag system motiv work attribut combin defin item pattern provid structur inform pattern current associ algorithm make full structur inform pattern inform lost encod attribut valu constrain hierarchi taxonomi pattern structur convei import knowledg pattern paper present architectur organ mine space base pattern structur exploit interrelationship pattern structur execut time mine reduc significantli advantag demonstr experi synthet real life dataset framework scalabl cost dsensit learn base comb probabl benefit cluster pattern similar larg data set cluster process group set object class similar object definit similar vari cluster model model concept similar base distanc euclidean distanc cosin distanc word similar object requir close valu set dimens paper explor gener type similar pcluster model propos object similar exhibit coher pattern subset dimens instanc dna microarrai analysi express level gene rise fall synchron respons set environment stimuli magnitud express level close pattern exhibit alik discoveri cluster gene essenti reveal signific connect gene regulatori network commerc applic collabor filter benefit model captur close valu lead indic close purchas brows pattern exhibit custom paper introduc effect algorithm detect cluster perform test real synthet data set show effect deduct databas system ldl paper describ system research advanc enabl design develop begin discuss nonmonoton nondeterminist construct extend function languag preserv model theoret fixpoint semant describ execut model open architectur design support construct facilit integr exist dbmss applic final describ lesson learn test applic middlewar datamin discoveri multi dattribut data user ddefin constraint farm framework explor mine space multipl attribut ssdt scalabl subspac dsplit classifi bias data dtree index structur subsequ match spatial object present tree index method subsequ match spatial object tree locat subsequ collect spatial sequenc sequenc made spatial object subsequ match queri pattern toler method base string search techniqu locat substr string symbol drawn discret alphabet ascii charact ii spatial access method index unsequenc spatial object tree appli solv problem subsequ match time seri data featur subsequ extract map spatial object support queri longest common pattern time seri previou subsequ match algorithm find difficult solv effici databas system extens decis support axl approach user defin aggreg object drelat system user defin aggreg essenti advanc databas applic express data mine function find support current system includ object relat databas limit current system inabl introduc aggreg code procedur languag origin propos sql ii inabl return partial result comput support onlin aggreg iii inabl aggreg recurs queri express bill materi optim graph search paper present unifi solut problem realiz sql origin propos user defin aggreg uda add signific improv term express power eas fact sql ag system support onlin aggreg monoton aggreg high level aggreg definit languag name sadl focu landmark model similar dbase pattern queri time seri databas paper present landmark model model time seri yield techniqu similar base time seri pattern queri landmark model follow tradit similar model reli pointwis euclidean distanc lead landmark similar gener model similar consist human intuit episod memori track specif subset featur landmark effici comput landmark similar measur invari subset transform shift uniform cmp fast decis tree classifi multivari predict decis tree classifi design class histogram singl attribut select attribut split histogram paper propos techniqu keep histogram attribut pair achiev signific speed tradit classifi base singl attribut split ii abil build classifi linear combin valu categor attribut pair split criterion keep dimension histogram cmp predict success split addit comput current cmp grow level decis tree data scan cmp perform improv due techniqu categor attribut discret loss classif accuraci fact introduc simpl techniqu classif error caus discret step correct step summari cmp repres unifi algorithm extend function exist classifi improv perform sql build aggreg extend object relat system user defin aggreg uda provid versatil mechan extend power applic object relat databas db paper describ axl system support sqlbase languag introduc uda axl easi learn databas programm preserv construct program paradigm data type sql imped mismatch sql procedur languag user defin function db axl inherit benefit databas queri languag scalabl data independ paralleliz paper show ad minim extens sql axl power capabl express complex algorithm cientli demonstr code data mine function advanc applic previous major problem sql databas due flexibl sql compati user defin aggreg logic data languag wave data intens knowledg base applic data mine decis support requir introduct complex applic specif aggreg function paper propos extens deduct databas system support applic develop construct formal semant implement techniqu user defin aggreg describ realiz extend ldl system recent built ucla extens system support onlin aggreg roll up data cube tempor aggreg time seri iceberg queri recent propos oper decis support data mine procedur discuss applic technolog dbmss sql specif support notion user defin aggreg show sql suffer limit sever restrict applic propos simpl extensio user ddefin aggreg datamin user defin aggreg linchpin sophist datamin function advanc databas applic demonstr effici implement db sql user defin aggreg extend earli return implement data mine algorithm aggreg earli return monoton freeli recurs queri introduct import rollup data cube decis support univers recogn aggreg sine qua built in releas commerci dbmss claim research vendor overlook userdefin aggreg uda plai critic pervas role databas centric data mine applic show ffl data mine algorithm reli special aggreg ffl number divers aggreg impli vendor ad ad hoc builtin user ddefin aggreg databas languag user defin aggreg linchpin sophist datamin function advanc databas applic find support current databas system includ object relat databas limit current databas inabl introduc aggreg code procedur languag propos sql ii inabl return partial result comput support onlin aggreg iii inabl aggreg recurs queri express bill materi bom applic optim graph search paper propos unifi solut problem discuss practic theoret aspect power addit databas languag introduct import special aggreg advanc applic exemplifi rollup data cube ow decis support applic sine user defin aggreg logic data languag wave data intens knowledg base applic data mine decis support requir introduct complex applic specif aggreg function paper propos extens deduct databas system support applic develop construct formal semant implement techniqu user defin aggreg describ realiz extend ldl system recent built ucla extens system support onlin aggreg roll up data cube tempor aggreg time seri iceberg queri recent propos oper decis support data mine procedur discuss applic technolog dbmss sql specif support notion user defin aggreg show sql suffer limit sever restrict applic propos simpl extensio 